A new modification of an iterative method based on inverse polynomial for solving Cauchy problems

نویسندگان

چکیده

This paper introduces a new modification to an iterative method for solving Cauchy problems (IVPs) based on inverse polynomial technique. The proposed is proven be consistent, stable, and convergent. We also demonstrate the consistency property of One-stage scheme Two-stage scheme, as well stability method. To validate accuracy our approach, we conduct several numerical experiments present results graphically. Our findings show that outperforms existing approaches in terms efficiency. Additionally, discuss implications future research this field. Overall, provides valuable contribution solution IVPs lays groundwork further exploration area.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Iterative Method For Solving Fuzzy Integral ‎Equations

In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are ‎valid.‎

متن کامل

A New Modification of Legendre-Gauss Collocation Method for Solving a Class of Fractional Optimal Control Problems

In this paper, the optimal conditions for fractional optimal control problems (FOCPs) were derived in which the fractional differential operators defined in terms of Caputo sense and reduces this problem to a system of fractional differential equations (FDEs) that is called twopoint boundary value (TPBV) problem. An approximate solution of this problem is constructed by using the Legendre-Gauss...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

fabrication of new ion sensitive field effect transistors (isfet) based on modification of junction-fet for analysis of hydronium, potassium and hydrazinium ions

a novel and ultra low cost isfet electrode and measurement system was designed for isfet application and detection of hydronium, hydrazinium and potassium ions. also, a measuring setup containing appropriate circuits, suitable analyzer (advantech board), de noise reduction elements, cooling system and pc was used for controlling the isfet electrode and various characteristic measurements. the t...

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arab journal of basic and applied sciences

سال: 2023

ISSN: ['2576-5299']

DOI: https://doi.org/10.1080/25765299.2023.2228054